GRASP and Variable Neighborhood Search for the Virtual Network Mapping Problem
نویسندگان
چکیده
Virtual network mapping considers the problem of fitting multiple virtual networks into one physical network in a cost-optimal way. This problem arises in Future Internet research. One of the core ideas is to utilize different virtual networks to cater to different application classes, each with customized protocols that deliver the required Quality-ofService. In this work we introduce a Greedy Randomized Adaptive Search Procedure (GRASP) andVariable Neighborhood Search (VNS) algorithm for solving the Virtual Network Mapping Problem. Both algorithms make use of a Variable Neighborhood Descent with ruin-and-recreate neighborhoods. We show that the VNS approach significantly outperforms the previously best known algorithms for this problem.
منابع مشابه
A Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملVariable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design
We introduce the Three-Layer Hierarchical Ring Network Design Problem, which arises especially in the design of large telecommunication networks. The aim is to connect nodes that are assigned to three different layers using rings of bounded length. We present tailored Variable Neighborhood Search (VNS) and GRASP approaches to solve large instances of this problem heuristically, and discuss comp...
متن کاملSolving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent
The Virtual Network Mapping Problem arises in the context of Future Internet research. Multiple virtual networks with different characteristics are defined to suit specific applications. These virtual networks, with all of the resources they require, need to be realized in one physical network in a most cost effective way. Two properties make this problem challenging: Already finding any valid ...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملTwo echelon-two indenture extended warranty distribution network under imperfect preventive maintenance policies
Nowadays, offering extended warranty is considered as a lucrative source of income from the perspective of the after-sale service providers. Meanwhile, the main concern is presence or absence of base warranty and strategies adopted by the manufacturer during this period. Moreover, extended warranty structure must be responsive and customer oriented, which not only control the services cost but ...
متن کامل